Liu and Layland's schedulability test revisited
نویسندگان
چکیده
In this paper, we study the problem of scheduling hard real-time periodic task sets on a single processor with the rate monotonic scheduler. We are concerned with the feasibility test given by Liu and Layland, based on the least upper bound of the utilization factor. We show that the result is incomplete and that the argument is incorrect. We complete and correct the result.
منابع مشابه
Schedulability Analysis and Utilization Bounds for Highly Scalable Real-Time Service
The proliferation of high-volume time-critical web services such as online trading calls f o r a scalable server design that allows meeting individual response-time guarantees of real-time transactions. A main challenge is to honor these guarantees despite unpredictability in incoming server load. The extremely high volume of real-time service requests mandates constant-time scheduling and sche...
متن کاملSchedulability Analysis and Utilization Bounds for Highly Scalable Real-Time Services
The proliferation of high-volume time-critical web services such as online trading calls f o r a scalable server design that allows meeting individual response-time guarantees of real-time transactions. A main challenge is to honor these guarantees despite unpredictability in incoming server load. The extremely high volume of real-time service requests mandates constant-time scheduling and sche...
متن کاملA Schedulable Utilization Bound for Aperiodic Tasks
In this paper, we derive a utilization bound on schedulability of apriodic tasks with arbitrary arrival times, execution times, and deadlines. To the author's knowledge, this is the rst time a utilization bound is derived for the aperiodic task model. It allows constructing an O(1) admission test for aperiodic tasks. Earlier admission tests are at best O(n). We show that deadline-monotonic sche...
متن کاملSchedulability analysis of synchronization protocols based on overrun without payback for hierarchical scheduling frameworks revisited
In this paper, we revisit global as well as local schedulability analysis of synchronization protocols based on the stack resource protocol (SRP) and overrun without payback for hierarchical scheduling frameworks based on fixed-priority pre-emptive scheduling (FPPS). We show that both the existing global and local schedulability analysis are pessimistic, present improved analysis, and illustrat...
متن کاملkU: A General Framework from k-Point Effective Schedulability Analysis to Utilization-Based Tests
To deal with a large variety of workloads in different application domains in real-time embedded systems, a number of expressive task models have been developed. For each individual task model, researchers tend to develop different types of techniques for deriving schedulability tests with different computation complexity and performance. In this paper, we present a general schedulability analy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 73 شماره
صفحات -
تاریخ انتشار 2000